On the Spread of Random Graphs
نویسندگان
چکیده
Combinatorics, Probability and Computing / Volume 23 / Issue 04 / July 2014, pp 477 504 DOI: 10.1017/S0963548314000248, Published online: 13 June 2014 Link to this article: http://journals.cambridge.org/abstract_S0963548314000248 How to cite this article: LOUIGI ADDARIO-BERRY, SVANTE JANSON and COLIN McDIARMID (2014). On the Spread of Random Graphs . Combinatorics, Probability and Computing, 23, pp 477-504 doi:10.1017/ S0963548314000248 Request Permissions : Click here
منابع مشابه
On the Spread of Supercritical Random Graphs
The spread of a connected graph G was introduced by Alon Boppana and Spencer [1] and measures how tightly connected the graph is. It is defined as the maximum over all Lipschitz functions f on V (G) of the variance of f(X) when X is uniformly distributed on V (G). We investigate the spread of a variety of random graphs, in particular the random regular graphs G(n, d), d ≥ 3, and Erdős-Rényi ran...
متن کاملContaining Viral Spread on Sparse Random Graphs: Bounds, Algorithms, and Experiments
Viral spread on large graphs has many real-life applications such as malware propagation in computer networks and rumor (or misinformation) spread in Twitter-like online social networks. Although viral spread on large graphs has been intensively analyzed on classical models such as Susceptible-InfectiousRecovered, there still exits a deficit of effective methods in practice to contain epidemic ...
متن کاملConvergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs
This work deals with convergence theorems and bounds on the cost of several layout measures for lattice graphs, random lattice graphs and sparse random geometric graphs. Specifically, we consider the following problems: Minimum Linear Arrangement, Cutwidth, Sum Cut, V ertex Separation, Edge Bisection and V ertex Bisection. For full square lattices, we give optimal layouts for the problems still...
متن کاملAbsorption Time of the Moran Process
The Moran process models the spread of mutations in populations on graphs. We investigate the absorption time of the process, which is the time taken for a mutation introduced at a randomly chosen vertex to either spread to the whole population, or to become extinct. It is known that the expected absorption time for an advantageous mutation is O(n) on an n-vertex undirected graph, which allows ...
متن کاملOptimizing spread dynamics on graphs by message passing
Cascade processes are responsible for many important phenomena in natural and social sciences. Simple models of irreversible dynamics on graphs, in which nodes activate depending on the state of their neighbors, have been succesfully applied to describe cascades in a large variety of contexts. Over the last decades, many efforts have been devoted to understand the typical behaviour of the casca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 23 شماره
صفحات -
تاریخ انتشار 2014